A Low-Complexity Massive MIMO Precoding Algorithm Based on Chebyshev Iteration
نویسندگان
چکیده
منابع مشابه
Near-Optimal Linear Precoding with Low Complexity for Massive MIMO
Linear precoding techniques can achieve nearoptimal capacity due to the special channel property in downlink massive MIMO systems, but involve high complexity since complicated matrix inversion of large size is required. In this paper, we propose a low-complexity linear precoding scheme based on the Gauss-Seidel (GS) method. The proposed scheme can achieve the capacity-approaching performance o...
متن کاملA Low Complexity User Selection Scheme with Linear Precoding for Massive MIMO Systems
Massive MIMO is the future of wireless communication systems as it promises 1000 times increase in data rates per cell. With large number of base station (BS) antennas, simple linear precoding schemes like zero forcing precoding would become computationally expensive due to the inversion of large channel matrices. User selection is an approach which extracts the effective part of the channel ma...
متن کاملLinear precoding based on polynomial expansion: reducing complexity in massive MIMO
Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, th...
متن کاملLinear Precoding Based on Polynomial Expansion: Reducing Complexity in Massive MIMO (extended version)
Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal nonlinear precoding are solved more-or-less automatically by enlarging system dimensions. However, the...
متن کاملPerformance Analysis for Massive MIMO Downlink with Low Complexity Approximate Zero-Forcing Precoding
Zero-forcing (ZF) precoding plays an important role for massive MIMO downlink due to its near optimal performance. However, the high computation cost of the involved matrix inversion hinders its application. In this paper, we adopt the first order Neumann series (NS) for a low-complexity approximation. By introducing a relaxation parameter jointly with one selected user’s interference to others...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2760881